Multiset-Valued Linear Index Grammars: Imposing Dominance Constraints on Derivations
نویسنده
چکیده
This paper defines multiset-valued linear index grammar and unordered vector grammar with dominance links. The former models certain uses of multiset-valued feature structures in unification-based formalisms , while the latter is motivated by word order variation and by "quasi-trees", a generalization of trees. The two formalisms are weakly equivalent, and an important subset is at most context-sensitive and polynomially parsable.
منابع مشابه
On the Computational Complexity of Dominance Links in Grammatical Formalisms
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (1994b), and inspiring quite a few recent formalisms. It turns out that MLIGs have since been rediscovered and reused in a variety of contexts, and that the complexity of their emptiness problem has become the key to seve...
متن کاملOn fuzzy multiset regular grammars
The main goal of this paper is to introduce and study fuzzy multiset regular grammar to show that fuzzy multiset finite automata and fuzzy multiset regular grammars are equivalent. We also study fuzzy multiset linear grammars and fuzzy multiset regular grammars in normal form. Furthermore, we show the equivalence of fuzzy multiset regular grammars, fuzzy multiset left linear grammars, fuzzy mul...
متن کاملConstraint Relation Multiset Grammars for Visual Languages
This paper proposes grammars for visual languages. The proposed grammars introduce relations into the constraint multiset grammars[4J. Relations are the constraints on the relationships among symbols in visual languages. The proposed grammars. which are called constraint relation multiset grammars. have the relations as the first class citizens of the grammars because the relationships among sy...
متن کاملPOINT DERIVATIONS ON BANACH ALGEBRAS OF α-LIPSCHITZ VECTOR-VALUED OPERATORS
The Lipschitz function algebras were first defined in the 1960s by some mathematicians, including Schubert. Initially, the Lipschitz real-value and complex-value functions are defined and quantitative properties of these algebras are investigated. Over time these algebras have been studied and generalized by many mathematicians such as Cao, Zhang, Xu, Weaver, and others. Let be a non-emp...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کامل